Stable Recovery with Analysis Decomposable Priors

نویسندگان

  • Mohamed-Jalal Fadili
  • Gabriel Peyré
  • Samuel Vaiter
  • Charles-Alban Deledalle
  • Joseph Salmon
چکیده

In this paper, we investigate in a unified way the structural properties of solutions to inverse problems. These solutions are regularized by the generic class of semi-norms defined as a decomposable norm composed with a linear operator, the so-called analysis type decomposable prior. This encompasses several well-known analysis-type regularizations such as the discrete total variation (in any dimension), analysis group-Lasso or the nuclear norm. Our main results establish sufficient conditions under which uniqueness and stability to a bounded noise of the regularized solution are guaranteed. Along the way, we also provide a strong sufficient uniqueness result that is of independent interest and goes beyond the case of decomposable norms.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Inverse Problem Regularization with Weak Decomposable Priors. Part I: Recovery Guarantees

This first talk is dedicated to assessing the theoretical recovery performance of this class of regularizers. We consider regularizations with convex positively 1homogenous functionals (in fact gauges) which obey a weak decomposability property. The weak decomposability will promote solutions of the inverse problem conforming to some notion of simplicity/low complexity by living on a low dimens...

متن کامل

Averaging of Decomposable Graphs by Dynamic Programming and Sampling

We present algorithms for Bayesian learning of decomposable models from data. Priors of a certain form admit exact averaging in O(3nn3) time and sampling T graphs from the posterior in O(4n + nT) time. To target a broader class of priors we associate each sample with an importance weight. Empirically, we compare averaging to optimization and demonstrate the accuracy of our importance sampling e...

متن کامل

Conditional Independence Models via Filtrations

We formulate a novel approach to infer conditional independence models or Markov structure of a multivariate distribution. Specifically, our objective is to place informative prior distributions over decomposable graphs and sample efficiently from the induced posterior distribution. The key idea we develop in this paper is a parametrization of decomposable hypergraphs using the geometry of poin...

متن کامل

Alternative parametrizations and reference priors for decomposable discrete graphical models

For a given discrete decomposable graphical model, we identify several alternative parametrizations, and construct the corresponding reference priors for suitable groupings of the parameters. Specifically, assuming that the cliques of the graph are arranged in a perfect order, the parameters we consider are conditional probabilities of clique-residuals given separators, as well as generalized l...

متن کامل

Tractable Bayesian Learning of Tree Belief Networks

In this paper we present decomposable priors, a family of priors over structure and parameters of tree belief nets for which Bayesian learning with complete observations is tractable, in the sense that the posterior is also decomposable and can be completely determined ana­ lytically in polynomial time. This fol­ lows from two main results: First, we show that factored distributions over spanni...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1304.4407  شماره 

صفحات  -

تاریخ انتشار 2013